Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational Complexity
نویسندگان
چکیده
منابع مشابه
Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational Complexity
Technological networks (e.g. telephone and sensor networks, Internet) have provided modern society with increased efficiency, but have also exposed us to the risks posed by their vulnerability to attacks. Mitigating these risks involves designing robust network topologies in situations where resources are economically constrained. In this paper, we consider the vulnerability of network topologi...
متن کاملModel Complexity-Accuracy Trade-off for a Convolutional Neural Network
Convolutional Neural Networks(CNN) has had a great success in the recent past, because of the advent of faster GPUs and memory access. CNNs are really powerful as they learn the features from data in layers such that they exhibit the structure of the V-1 features of the human brain. A huge bottleneck in this case is that CNNs are very large and have a very high memory footprint, and hence they ...
متن کاملPerformance versus Computational Complexity Trade-Off in Face Verification
We discuss the implementation of a face verification system on smart card and study the trade-off between performance and computational complexity. In order to establish the system limitations, a study was performed on BANCA and XM2VTS databases. The results of the experiments performed show that the choice of a fixed precision data type does not affect system performance very much but can spee...
متن کاملQuantifying Network Topology Robustness under Budget Constraints: General Model and Computational Complexity
Recently, network blocking game (NBG) models have been introduced and utilized to quantify the vulnerability of network topologies in adversarial environments. In NBG models, the payoff matrix of the game is only “implicitly” given. As a consequence, computing a Nash equilibrium in these games is expected to be harder than in more conventional models, where the payoff matrix is “explicitly” giv...
متن کاملThe trade-off between speed and complexity
The hypothesis that there has been selection pressure for mechanisms which enable us to perceive the present tends to be conflated with the hypothesis that there has been selection pressure for mechanisms that compensate for inevitable neural delay. The relationship between the two is more subtle, because increases in neural delay can be advantageous for building more useful perceptions. Propon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2015
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2015.1018019